Topological obstructions to fatness

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological Obstructions to Graph Colorings

For any two graphs G and H Lovász has defined a cell complex Hom (G,H) having in mind the general program that the algebraic invariants of these complexes should provide obstructions to graph colorings. Here we announce the proof of a conjecture of Lovász concerning these complexes with G a cycle of odd length. More specifically, we show that If Hom (C2r+1, G) is k-connected, then χ(G) ≥ k + 4....

متن کامل

Topological Obstructions to Localization Results

In this paper we present topology aspects in non-localization results. A well-known such no-go result is the BalianLow theorem that states the generator of a Weyl-Heisenberg Riesz basis cannot be well time-frequency localized. More general, the statement applies to multi WH Riesz bases, or super frames as well. These results turn out to be connected to non-triviality of a complex vector bundle....

متن کامل

Topological Obstructions to Certain Lie Group Actions on Manifolds

Given a smooth closed S1-manifold M , this article studies the extent to which certain numbers of the form (f∗ (x) · P · C) [M ] are determined by the fixed-point set MS 1 , where f : M → K (π1 (M) , 1) classifies the universal cover of M , x ∈ H∗ (π1 (M) ;Q), P is a polynomial in the Pontrjagin classes of M , and C is in the subalgebra of H∗ (M ;Q) generated by H2 (M ;Q). When MS 1 = ∅, variou...

متن کامل

Topological obstructions for vertex numbers of Minkowski sums

We show that for polytopes P1, P2, . . . , Pr ⊂ R, each having ni ≥ d + 1 vertices, the Minkowski sum P1 + P2 + · · · + Pr cannot achieve the maximum of ∏ i ni vertices if r ≥ d. This complements a recent result of Fukuda & Weibel (2006), who show that this is possible for up to d − 1 summands. The result is obtained by combining methods from discrete geometry (Gale transforms) and topological ...

متن کامل

Local Chromatic Number and Distinguishing the Strength of Topological Obstructions

The local chromatic number of a graph G is the number of colors appearing in the most colorful closed neighborhood of a vertex minimized over all proper colorings of G. We show that two specific topological obstructions that have the same implications for the chromatic number have different implications for the local chromatic number. These two obstructions can be formulated in terms of the hom...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Geometry & Topology

سال: 2011

ISSN: 1364-0380,1465-3060

DOI: 10.2140/gt.2011.15.891